The Connections Among Hamming Metric, <i>b</i>-Symbol Metric, and <i>r</i>-th Generalized Hamming Metric
نویسندگان
چکیده
The $r$ -th generalized Hamming metric and the notation="LaTeX">$b$ -symbol are two different generalizations of metric. former is used on wire-tap channel Type II, latter motivated by limitations reading process in high-density data storage systems applied to a read that outputs overlapping symbols. In this paper, we study connections among three metrics (that is, metric, metric) mentioned above give conjecture about Griesmer Bound for cyclic codes.
منابع مشابه
Weighted Hamming Metric Structures
A weighted Hamming metric is introduced in [4] and it showed that the binary generalized Goppa code is a perfect code in some weighted Hamming metric. In this paper, we study the weight structures which admit the binary Hamming code and the extended binary Hamming code to be perfect codes in the weighted Hamming metric. And, we also give some structures of a 2-perfect code and how to construct ...
متن کاملHamming Distance Metric Learning
Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that preserve semantic similarity. Binary codes are well suited to large-scale applications as they are storage efficient and permit exact sub-linear kNN search. The framework is applicable to broad families of mappings, and uses a flexible form of triplet ranking loss. We ov...
متن کاملNew bounds of permutation codes under Hamming metric and Kendall's τ -metric
Permutation codes are widely studied objects due to their numerous applications in various areas, such as power line communications, block ciphers, and the rank modulation scheme for flash memories. Several kinds of metrics are considered for permutation codes according to their specific applications. This paper concerns some improvements on the bounds of permutation codes under Hamming metric ...
متن کاملClass of Binary Generalized Goppa Codes Perfect in Weighted Hamming Metric
The class of the binary generalized Goppa codes is offered. It is shown that the codes of this class are on the Hamming bound constructed for a weighted metric.
متن کاملmetric frames
dar in paian name dar ebteda mafahim topologicy baian mishavad va sepas mafahim rastehie va frames ha ra baian mikonim
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3239543